Looking for an Analogue of Rice's Theorem in Complexity Theory
نویسندگان
چکیده
Rice's Theorem says that every nontrivial semantic property of programs is undecidable. It this spirit we show the following: Every nontrivial absolute (gap, relative) counting property of circuits is UP-hard with respect to polynomial-time Turing reductions.
منابع مشابه
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting property of circuits is UP-hard with respect to polynomial-time Turing reductions. For generators [31] we show a perfect analogue of Rice’s Theorem. Mathematics Subject Classification: 03D15, 68Q15.
متن کاملUniversal Grammar and Chaos/Complexity Theory: Where Do They Meet And Where Do They Cross?
Abstract The present study begins by sketching "Chaos/Complexity Theory" (C/CT) and its applica-tion to the nature of language and language acquisition. Then, the theory of "Universal Grammar" (UG) is explicated with an eye to C/CT. Firstly, it is revealed that CCT may or may not be allied with a theory of language acquisition that takes UG as the initial state of language acquisition for ...
متن کاملComplexity-Theoretic Analogs of Rice's Theorem
Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert and Stephan BS96] initiated a search for complexity-theoretic analogs of Rice's Theorem. In particular, they proved that every nontrivial counting property of circuits is UP-hard. We extend their result by proving that every nontrivial counting property of circuits is UP O(1...
متن کاملErratum to "The Ricean Objection: An Analogue of Rice's Theorem for First-Order Theories" . Logic Journal of the IGPL, 16(6): 585-590(2008)
There is an error in the proof of the main theorem on page 6 (''Rice's Theorem for Logic''). If φ is undecidable in Q, the claim that Ax1 and Ax2 are tautologies is not valid, and this fact compromises the rest of the proof. Furthermore, the following decidable property is a counterexample to our result: Definition 1. Let T be a theory. A theory T + is an extension of T if Th(T) ⊆ Th(T +). Defi...
متن کاملGodel's Incompleteness Phenomenon - Computationally
We argue that Gödel’s completeness theorem is equivalent to completability of consistent theories, and Gödel’s incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some consistent and recursively enumerable theories which cannot be extended to any complete and consistent and recursively enumerable theory. Though any consistent an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 3 شماره
صفحات -
تاریخ انتشار 1996